/**
 * Java：每月交易 I
 *
 * @author：紫水木鱼
 * @createDate：2024-12-27 10:34:15
 */
package leetcode.editor.cn;

import leetcode.editor.entity.*;
//表：Transactions
//
// 
//+---------------+---------+
//| Column Name   | Type    |
//+---------------+---------+
//| id            | int     |
//| country       | varchar |
//| state         | enum    |
//| amount        | int     |
//| trans_date    | date    |
//+---------------+---------+
//id 是这个表的主键。
//该表包含有关传入事务的信息。
//state 列类型为 ["approved", "declined"] 之一。
// 
//
// 
//
// 编写一个 sql 查询来查找每个月和每个国家/地区的事务数及其总金额、已批准的事务数及其总金额。 
//
// 以 任意顺序 返回结果表。 
//
// 查询结果格式如下所示。 
//
// 
//
// 示例 1: 
//
// 
//输入：
//Transactions table:
//+------+---------+----------+--------+------------+
//| id   | country | state    | amount | trans_date |
//+------+---------+----------+--------+------------+
//| 121  | US      | approved | 1000   | 2018-12-18 |
//| 122  | US      | declined | 2000   | 2018-12-19 |
//| 123  | US      | approved | 2000   | 2019-01-01 |
//| 124  | DE      | approved | 2000   | 2019-01-07 |
//+------+---------+----------+--------+------------+
//输出：
//+----------+---------+-------------+----------------+--------------------+----
//-------------------+
//| month    | country | trans_count | approved_count | trans_total_amount | 
//approved_total_amount |
//+----------+---------+-------------+----------------+--------------------+----
//-------------------+
//| 2018-12  | US      | 2           | 1              | 3000               | 100
//0                  |
//| 2019-01  | US      | 1           | 1              | 2000               | 200
//0                  |
//| 2019-01  | DE      | 1           | 1              | 2000               | 200
//0                  |
//+----------+---------+-------------+----------------+--------------------+----
//-------------------+ 
//
// Related Topics 数据库 👍 137 👎 0

//每月交易 I
class MonthlyTransactionsI {
    public static void main(String[] args) {
        Solution solution = new MonthlyTransactionsI().new Solution();
        // TO TEST
    }
    //There is no code of Java type for this problem
    //leetcode submit region begin(Prohibit modification and deletion)

    /**
     * Definition for singly-linked list.
     * public class ListNode {
     * int val;
     * ListNode next;
     * ListNode() {}
     * ListNode(int val) { this.val = val; }
     * ListNode(int val, ListNode next) { this.val = val; this.next = next; }
     * }
     */
    class Solution {
        public ListNode removeZeroSumSublists(ListNode head) {
            return null;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)
}